Embedding Shapes without Predefined Parts
نویسندگان
چکیده
منابع مشابه
Embedding shapes without predefined parts
For a practical computer implementation of part embedding in shapes that is also true to their continuous character and the shape grammar formalism, shapes and their boundaries are handled together in composite shape and label algebras. Temporary representations of shapes, termed `overcomplete graphs', comprise boundary elements of shapes and how they are assembled, and are utilized in a two-ph...
متن کاملBuilding 3D Shapes from Parts
The research described in this thesis has focused on the composition of novel 3D shapes (e.g., depth maps and triangulated meshes) by reusing parts of existing shapes. Specifically, two methods were designed [28, 27]. The first is a novel tool for easy composition of existing 3D models (i.e., triangulated meshes) into novel models [28]. This tool was designed with the intention of providing a m...
متن کاملUnsupervised Segmentation of Predefined Shapes in Multivariate Images
Fuzzy C-means (FCM) is an unsupervised clustering technique and is often used for the unsupervised segmentation of multivariate images. In traditional FCM the clustering is based on spectral information only and geometrical relationship between neighbouring pixels is not used in the clustering procedure. In this paper, the Spatially Guided FCM (SGFCM) algorithm is presented which segments multi...
متن کاملPerceiving parts and shapes from concave surfaces.
"A hole is nothing at all, but it can break your neck." In a similar fashion to the danger illustrated by this folk paradox, concave regions pose difficulties to theories of visual shape perception. We can readily identify their shapes, but according to principles of how observers determine part boundaries, concavities in a planar surface should have very different figural shapes from the ones ...
متن کاملEvolving Morphological and Behavioral Diversity Without Predefined Behavior Primitives
Virtual ecosystems, where natural selection is used to evolve complex agent behavior, are often preferred to traditional genetic algorithms because the absence of an explicitly defined fitness allows for a less constrained evolutionary process. However, these model ecosystems typically pre-specify a discrete set of possible action primitives the agents can perform. We think that this also const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environment and Planning B: Planning and Design
سال: 2010
ISSN: 0265-8135,1472-3417
DOI: 10.1068/b36010